A practical comparison of two K-Means clustering algorithms
نویسندگان
چکیده
منابع مشابه
Comparison of distributed evolutionary k-means clustering algorithms
Dealing with distributed data is one of the challenges for clustering, as most clustering techniques require the data to be centralized. One of them, k-means, has been elected as one of the most influential data mining algorithms for being simple, scalable, and easily modifiable to a variety of contexts and application domains. However, exact distributed versions of k-means are still sensitive ...
متن کاملClustering performance comparison using K-means and expectation maximization algorithms
Clustering is an important means of data mining based on separating data categories by similar features. Unlike the classification algorithm, clustering belongs to the unsupervised type of algorithms. Two representatives of the clustering algorithms are the K-means and the expectation maximization (EM) algorithm. Linear regression analysis was extended to the category-type dependent variable, w...
متن کاملA study of K-Means-based algorithms for constrained clustering
The problem of clustering with constraints has received considerable attention in the last decade. Indeed, several algorithms have been proposed, but only a few studies have (partially) compared their performances. In this work, three well-known algorithms for k-means-based clustering with soft constraints — Constrained Vector Quantization Error (CVQE), its variant named LCVQE, and the Metric P...
متن کاملMLK-Means - A Hybrid Machine Learning based K-Means Clustering Algorithms for Document Clustering
Document clustering is useful in many information retrieval tasks such as document browsing, organization and viewing of retrieval results. They are very much and currently the subject of significant global research. Generative models based on the multivariate Bernoulli and multinomial distributions have been widely used for text classification. In this work, address a new hybrid algorithm call...
متن کاملA Survey on Various K-Means algorithms for Clustering
Data Mining is the process to find out the data from large data sets and transform into the valuable information. In this paper we are presenting about the clustering techniques and the impact noise on clustering techniques. Clustering is important in data analysis and data mining applications. It is the task of grouping a set of objects so that objects in the same group are more similar to eac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2008
ISSN: 1471-2105
DOI: 10.1186/1471-2105-9-s6-s19